package com.wfm.leetcode.editor.cn;
public class PSix2不同路径{
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        // 初始化第0行
        for (int i = 0; i < m; i++) {
            dp[i][0]=1;
        }
        // 初始化第0列
        for (int i = 0; i < n; i++) {
            dp[0][i]=1;
        }
        // 从【1，1】开始，依赖左和上
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j]=dp[i][j-1]+dp[i-1][j];
            }
        }
        return dp[m-1][n-1];
    }
}
//leetcode submit region end(Prohibit modification and deletion)

    public static void main(String[] args) { 
        Solution solution = new PSix2不同路径().new Solution();
    }
}